Solving the Constrained Job Sequencing Problem using Candidate Order based Tabu Search
نویسندگان
چکیده
منابع مشابه
Solving the maximum clique problem using a tabu search approach
We describe two variants of a tabu search heuristic, a deterministic one and a probabilistic one, for the maximum clique problem. This heuristic may be viewed as a natural alternative implementation of tabu search for this problem when compared to existing ones. We also present a new random graph generator, the/S-generator, which produces graphs with larger clique sizes than comparable ones obt...
متن کاملEfficiently solving the redundancy allocation problem using tabu search
SADAN KULTUREL-KONAK1, ALICE E. SMITH2 and DAVID W. COIT3 1Management Information Systems, Penn State Berks-Lehigh Valley College, Tulpehocken Road, P.O. Box 7009, Reading, PA 19610-6009, USA E-mail: [email protected] 2Department of Industrial and Systems Engineering, Auburn University, 207 Dunstan Hall, Auburn, AL 36849, USA E-mail: [email protected] 3Department of Industrial and Systems Engi...
متن کاملSolving the uncapacitated facility location problem using tabu search
A tabu search heuristic procedure is developed to solve the uncapacitated facility location problem. Tabu search is used to guide the solution process when evolving from one solution to another. A move is defined to be the opening or closing of a facility. The net cost change resulting from a candidate move is used to measure the attractiveness of the move. After a move is made, the net cost ch...
متن کاملTabu Search for a Car Sequencing Problem
The goal of this paper is to propose a tabu search heuristic for the car sequencing problem (CSP) used for the ROADEF 2005 international Challenge. This NP-hard problem was proposed by the automobile manufacturer Renault. The first objective of the car industry is to assign a production day to each customer-ordered car and the second one consists of scheduling the order of cars to be put on the...
متن کاملAn Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints
Flexible manufacturing systems (FMSs) are nowadays installed in the mechanical industry. In such systems. many different part types are produced simultaneously and it is necessary to take tooling constraints into account for finding an optimal schedule. A heuristic method is presented for solving the m-machine, n-job shop scheduling problem with tooling constraints. This method. named TOMATO, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Information Systems
سال: 2016
ISSN: 1229-8476
DOI: 10.5859/kais.2016.25.1.159